Factoring out Free Fields
نویسندگان
چکیده
For a generic W algebra, we give an algorithmic procedure for factoring out all fields of dimension 1/2, both bosonic and fermionic, and some fields of dimension 1. This generalizes and makes more explicit the GoddardSchwimmer theorem for free fermions. We also show how the induced gravity theory for the original W algebra containing the free fields relates to the theory where the fields are factored out.
منابع مشابه
Factoring Health Equations; Comment on “Do You Recommend an Interdisciplinary Field to Your Graduate Student?”
The International Journal of Health Policy and Management (IJHPM) is a new journal that aims to stimulate not only inter-disciplinary research relating to health, but even an entire new generation of such journals. The challenges of improving human health worldwide clearly suggest ‘why’ such a journal is needed, but ‘how’ bridges and junctions across fields of study towards this end might be fo...
متن کاملSplitting quaternion algebras over quadratic number fields
We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over Q( √ d) where d is a square-free integer. The algorithm is deterministic and runs in polynomial time if one is allowed to call oracles for factoring integers and polynomials over finite fields.
متن کاملA New Algorithm for Factoring Polynomials Over Finite Fields
We present a new probabilistic algorithm for factoring polynomials over finite fields.
متن کاملTrading GRH for algebra: algorithms for factoring polynomials and related structures
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a polynomial f(x) of degree n over a finite field k, we can find in deterministic poly(n n, log |k|) time either a nontrivial factor of f(x) or a nontrivial au...
متن کاملFactoring Multivariate Polynomials over Algebraic Number Fields
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented...
متن کامل